Search results

This paper gives a bibliographical review of the finite element and boundary element parallel processing techniques from the theoretical and application points of view. Topics include: theory – domain decomposition/partitioning, load balancing, parallel solvers/algorithms, parallel mesh generation, adaptive methods, and visualization/graphics; applications – structural mechanics problems, dynamic problems, material/geometrical non‐linear problems, contact problems, fracture mechanics, field problems, coupled problems, sensitivity and optimization, and other problems; hardware and software environments – hardware environments, programming techniques, and software development and presentations. The bibliography at the end of this paper contains 850 references to papers, conference proceedings and theses/dissertations dealing with presented subjects that were published between 1996 and 2002.

This paper describes a parallel algorithm for the dynamic relaxation (DR) method. The basic theory of the dynamic relaxation is briefly reviewed to prepare the reader for the parallel implementation of the algorithm. Some fundamental parallel processing schemes have been explored for the implementation of the algorithm. Geometric Parallelism was found suitable for the DR method when using transputer‐based systems. The evolution of the parallel algorithm is given by identifying the steps which may be executed in parallel. The structure of the parallel code is discussed and then described algorithmically. Two geometrically non‐linear parallel finite element analyses have been performed using different mesh densities. The number of processors was varied to investigate algorithm efficiency and speed ups. Using the results obtained it is shown that the computational efficiency increases when the computational load per processor is increased.

Presents a review on implementing finite element methods on supercomputers, workstations and PCs and gives main trends in hardware and software developments. An appendix included at the end of the paper presents a bibliography on the subjects retrospectively to 1985 and approximately 1,100 references are listed.

The use of three non‐linear mathematical programming techniques for the optimization of structural design problems is discussed. The methods — sequential linear programming, the feasible direction method and the sequential unconstrained minimization technique — are applied to a portal frame problem to enable a study of their convergence efficiency to be studied. These methods are used for both the sizing of the structural members and determining the optimum roof pitch. The sequential linear programming method is shown to be particularly efficient for application to structural design problems. Some comments on the development of computer software for structural optimization are also given.

This paper presents a routing method for two dimensional transputer arrays particularly designed for parallel non‐linear and dynamic finite element analysis. Some general routing strategies with their strengths and weaknesses are discussed. The need for problem specific routing algorithms in transputer systems is considered and the communication requirements for parallel finite element analysis described. From the communication requirements the design parameters for the routing method are specified and the architectural design of the Router presented. An example of the use of the Router in the parallel non‐linear finite element analysis is given and the robustness of the routing methodology is illustrated by using arbitrary mappings of finite element subdomains distributed over a transputer array.

Gives a bibliographical review of the finite element methods (FEMs) applied for the linear and nonlinear, static and dynamic analyses of basic structural elements from the theoretical as well as practical points of view. The range of applications of FEMs in this area is wide and cannot be presented in a single paper; therefore aims to give the reader an encyclopaedic view on the subject. The bibliography at the end of the paper contains 2,025 references to papers, conference proceedings and theses/dissertations dealing with the analysis of beams, columns, rods, bars, cables, discs, blades, shafts, membranes, plates and shells that were published in 1992‐1995.

Gives a bibliographical review of the finite element meshing and remeshing from the theoretical as well as practical points of view. Topics such as adaptive techniques for meshing and remeshing, parallel processing in the finite element modelling, etc. are also included. The bibliography at the end of this paper contains 1,727 references to papers, conference proceedings and theses/dissertations dealing with presented subjects that were published between 1990 and 2001.

Gives a bibliographical review of the error estimates and adaptive finite element methods from the theoretical as well as the application point of view. The bibliography at the end contains 2,177 references to papers, conference proceedings and theses/dissertations dealing with the subjects that were published in 1990‐2000.

This paper describes how non‐orthogonal geometric models may be transformed into orthogonal polyhedral models. The main purpose of the transformation is to obtain a geometric model that is easy to describe and further modify without loss of topological information from the original model.

The transformation method presented in this paper is based on fuzzy logic (FL). The idea of using FL for this type of transformation was first described by Takahashi and Shimizu. This paper describes both philosophy and techniques behind the transformation method as well as its application to some example 2D and 3D models. The problem in this paper is to define a transformation technique that will change a non‐orthogonal model into a similar orthogonal model. The orthogonal model is unknown at the start of the transformation and will only be specified once the transformation is complete. The model has to satisfy certain conditions, i.e. it should be orthogonal.

The group of non‐orthogonal models that contain triangular faces such as tetrahedra or pyramids cannot be successfully recognized using this method. This algorithm fails to transform these types of problem because to do so requires modification of the structure of the model. It appears that only when the edges are divided into pieces and the sharp angles are smoothed then the method can be successfully applied. Even though the method cannot be applied to all geometric models many successful examples for 2D and 3D transformation are presented. Orthogonal models with the same topology, which make them easier to describe, are obtained.

This transformation makes it possible to apply simple algorithms to orthogonal models enabling the solution of complex problems usually requiring non‐orthogonal models and more complex algorithms.

The purpose of this paper is to introduce a general equation for eigensolution. Eigenvalues and eigenvectors of graphs have many applications in combinatorial optimization and structural mechanics. Some important applications of graph products consist of nodal ordering and graph partitioning for structuring the structural matrices and finite element subdomaining, respectively.

In the existing methods for the eigensolution of Laplacian matrices, members have been added to the model of a graph product such that for its Laplacian matrix an algebraic relation between blocks become possible. These methods are categorized as topological approaches. Here, using concepts of linear algebra a general algebraic method is developed.

A new algebraic method is introduced for calculating the eigenvalues of Laplacian matrices in graph products.

The present method provides a simple tool for calculating the eigenvalues of the Laplacian matrices without using the configurational model and merely by using the Laplacian matrices. The developed formula for calculating the eigenvalues contains approximate terms which can be managed by the analyst.